k+ Decision Trees
نویسندگان
چکیده
Consider a wireless sensor network in which each node possesses a bit of information.Suppose all sensors with the bit 1 broadcast this fact to a central processor. If zero or one sensors broadcast, the central processor can detect this fact. If two or more sensors broadcast, the central processor can only detect that there is a “collision.” Although collisions may seem to be a nuisance,they can in some cases help the central processor compute an aggregate function of the sensors’
منابع مشابه
A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملAn Efficient Predictive Model for Probability of Genetic Diseases Transmission Using a Combined Model
In this article, a new combined approach of a decision tree and clustering is presented to predict the transmission of genetic diseases. In this article, the performance of these algorithms is compared for more accurate prediction of disease transmission under the same condition and based on a series of measures like the positive predictive value, negative predictive value, accuracy, sensitivit...
متن کاملPredicting The Type of Malaria Using Classification and Regression Decision Trees
Predicting The Type of Malaria Using Classification and Regression Decision Trees Maryam Ashoori1 *, Fatemeh Hamzavi2 1School of Technical and Engineering, Higher Educational Complex of Saravan, Saravan, Iran 2School of Agriculture, Higher Educational Complex of Saravan, Saravan, Iran Abstract Background: Malaria is an infectious disease infecting 200 - 300 million people annually. Environme...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملCollisions Lead to Shallower Decision Trees
We study the following generalization of decision trees, which we call k-decision trees (where k > 1 is an integer). The algorithms are now allowed to query any arbitrary subset of the n input bits and the answer to the query tells if the number of ones in the subset is 0, 1, . . . , k − 1 or at least k. We also allow the algorithm to make similar queries for the number of zeroes. Our study of ...
متن کاملInduction of Quadratic Decision Trees using Genetic Algorithms and k-D Trees
Genetic Algorithm-based Quadratic Decision Tree (GA-based QDT) has been applied successfully in various classification problems with non-linear class boundaries. However, the execution time of GA-based QDT is quite long. In this paper, a new version of GA-based QDT, called Genetic Algorithm-based Quadratic Decision Tree with k-D Tree (GA-based QDT with k-D Tree), is proposed. In the proposed al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009